3,024 research outputs found

    Effect of Nuangong zhitong decoction on primary dysmenorrhea in mice

    Get PDF
    Purpose: To investigate the therapeutic effect of Nuangong Zhitong decoction (NZD) on primary dysmenorrhea (PD) in mice, and its mechanism of action. Methods: Dysmenorrhea was established in female PD mice by intraperitoneal injection of oxytocin following estradiol benzoate pretreatment. The effects of NZD and its active principles (cinnamic aldehyde and cinnamic acid) on PD were determined using body twist method. Serum levels of prostaglandin E2 (PGE2) and prostaglandin F2 alpha (PGF2α) in mice were measured using ELISA. Results: The results showed that NZD dose-dependently reduced oxytocin-induced writhing responses (p < 0.05). Moreover, cinnamic aldehyde and cinnamic acid reduced oxytocin-induced writhing responses in a concentration-dependent manner, with maximal inhibitions of 65.01 and 70.67 %, respectively, and also decreased serum levels of PGE2 and PGF2α in PD mice (p < 0.05). Conclusion: These results indicate that NZD mitigates oxytocin-induced uterine tetanic contraction in mice. Thus, NZD has a potential for development into an anti-dysmenorrheal drug for use in humans

    Pseudodeterministic lagorithms and the structure of probabilistic time

    Get PDF
    We connect the study of pseudodeterministic algorithms to two major open problems about the structural complexity of BPTIME: proving hierarchy theorems and showing the existence of complete problems. Our main contributions can be summarised as follows. A new pseudorandom generator and its consequences. We build on techniques developed to prove hierarchy theorems for probabilistic time with advice (Fortnow and Santhanam, FOCS 2004) to construct the first unconditional pseudorandom generator of polynomial stretch computable in pseudodeterministic polynomial time (with one bit of advice) that is secure infinitely often against polynomial-time computations. As an application of this construction, we obtain new results about the complexity of generating and representing prime numbers. For instance, we show unconditionally for each ε > 0 that infinitely many primes pn have a succinct representation in the following sense: there is a fixed probabilistic polynomial time algorithm that generates pn with high probability from its succinct representation of size O(|pn|ε). This offers an exponential improvement over the running time of previous results, and shows that infinitely many primes have succinct and efficient representations. Structural results for probabilistic time from pseudodeterministic algorithms. Oliveira and Santhanam (STOC 2017) established unconditionally that there is a pseudodeterministic algorithm for the Circuit Acceptance Probability Problem (CAPP) that runs in sub-exponential time and is correct with high probability over any samplable distribution on circuits on infinitely many input lengths. We show that improving this running time or obtaining a result that holds for every large input length would imply new time hierarchy theorems for probabilistic time. In addition, we prove that a worst-case polynomial-time pseudodeterministic algorithm for CAPP would imply that BPP has complete problems. Equivalence between pseudodeterministic constructions and hierarchies. We establish an equivalence between a certain explicit pseudodeterministic construction problem and the existence of strong hierarchy theorems for probabilistic time. More precisely, we show that pseudodeterministically constructing in exponential time strings of large rKt complexity (Oliveira, ICALP 2019) is possible if and only if for every constructive function T(n) ≤ exp(o(exp(n))) we have BPTIME[poly(T)] ⊈ i.o.BPTIME[T]/logT. More generally, these results suggest new approaches for designing pseudodeterministic algorithms for search problems and for unveiling the structure of probabilistic time

    Systematic analysis of strange single heavy baryons Ξc\Xi_{c} and Ξb\Xi_{b}

    Full text link
    Motivated by the experimental progress in the study of heavy baryons, we investigate the mass spectra of strange single heavy baryons in the λ\lambda-mode, where the relativistic quark model and the infinitesimally shifted Gaussian basis function method are employed. It is shown that the experimental data can be well reproduced by the predicted masses. The root mean square radii and radial probability density distributions of the wave functions are analyzed in detail. Meanwhile, the mass spectra allow us to successfully construct the Regge trajectories in the (J,M2)(J,M^{2}) plane. We also preliminarily assign quantum numbers to the recently observed baryons, including Ξc(3055)\Xi_{c}(3055), Ξc(3080)\Xi_{c}(3080), Ξc(2930)\Xi_{c}(2930), Ξc(2923)\Xi_{c}(2923), Ξc(2939)\Xi_{c}(2939), Ξc(2965)\Xi_{c}(2965), Ξc(2970)\Xi_{c}(2970), Ξc(3123)\Xi_{c}(3123), Ξb(6100)\Xi_{b}(6100), Ξb(6227)\Xi_{b}(6227), Ξb(6327)\Xi_{b}(6327) and Ξb(6333)\Xi_{b}(6333). At last, the spectral structure of the strange single heavy baryons is shown. Accordingly, we predict several new baryons that might be observed in forthcoming experiments.Comment: 27 pages, 11 figures, 8 table
    • …
    corecore